Collision free region determination by modified polygonal Boolean operations
نویسندگان
چکیده
Cutting and packing problems are found in numerous industries such as garment, wood and shipbuilding. The collision free region concept is presented, as it represents all the translations possible for an item to be inserted into a container with already placed items. The often adopted nofit polygon concept and its analogous concept inner fit polygon are used to determine the collision free region. Boolean operations involving nofit polygons and inner fit polygons are used to determine the collision free region. New robust non-regularized Boolean operations algorithm is proposed to determine the collision free region. The algorithm is capable of dealing with degenerated boundaries. This capability is important because degenerated boundaries often represent local optimal placements. A parallelized version of the algorithm is also proposed and tests are performed in order to determine the execution times of both the serial and parallel versions of the algorithm. © 2013 Elsevier Ltd. All rights reserved.
منابع مشابه
Accurate Sampling-Based Algorithms for Surface Extraction and Motion Planning
GOKUL VARADHAN: Accurate Sampling-Based Algorithms for Surface Extraction and Motion Planning. (Under the direction of Dinesh Manocha.) Boolean operations, Minkowski sum evaluation, configuration space computation, and motion planning are fundamental problems in solid modeling and robotics. Their applications include computer-aided design, numerically-controlled machining, tolerance verificatio...
متن کاملRobust and Accurate Boolean Operations on Polygonal Models
We present a new sampling-based method for the efficient and reliable calculation of boundary surface defined by a Boolean operation of given polygonal models. We first construct uniform volumetric cells with sampling points for each geometric element of polygonal models. We then calculate an error-minimizing point in each cell based on a quadratic error function (QEF). Based on a novel adaptiv...
متن کاملAn implemented planner for manipulating a polygonal object in the plane with three disc-shaped mobile robots
This paper presents an implementation of a planner that uses three disc-shaped robots to manipulate a polygonal object in the plane in the presence of obstacles. The approach is based on the computation of the maximal discs (dubbed maximal independent capture discs or MICaDs) where the robots can move independently while preventing the object from escaping their grasp. It has been shown that, i...
متن کاملMotion planning for disc-shaped robots pushing a polygonal object in the plane
This paper addresses the problem of using three disc-shaped robots to manipulate a polygonal object in the plane in the presence of obstacles. The proposed approach is based on the computation of maximal discs (dubbed maximum independent capture discs, or MICaDs) where the robots can move independently while preventing the object from escaping their grasp. It is shown that, in the absence of ob...
متن کاملMultiple Clothing Part Placement: Direct Representation of Curves vs. Polygonal Approximation
Techniques exist for numerically robust cascaded set operations on planar polygonal regions: Boolean operations (union, intersection, difference) and Minkowski sum1. Numerically robust means that the symmetric difference with the ideal exact output is small. Cascaded means that the numerical representation has bounded complexity so that the output can become the input again. So called ECG (Exac...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computer-Aided Design
دوره 45 شماره
صفحات -
تاریخ انتشار 2013